package A1动态规划;

public class LC_746使用最小花费爬楼梯 {
    public static void main(String[] srgs){
        int[] cost={10,15,20};
        System.out.println(minCostClimbingStairs(cost));
    }
    public static int minCostClimbingStairs(int[] cost) {
        int[] dp=new int[cost.length+1];
        dp[0]=0;
        dp[1]=0;
        for(int i=2;i<=cost.length;i++)
            dp[i]=Math.min(dp[i-1]+cost[i-1],dp[i-2]+cost[i-2]);
        return dp[cost.length+1];
    }
}
